Measuring Inconsistency in Answer Set Programs
نویسندگان
چکیده
We address the issue of quantitatively assessing the severity of inconsistencies in logic programs under the answer set semantics. While measuring inconsistency in classical logics has been investigated for some time now, taking the non-monotonicity of answer set semantics into account brings new challenges that have to be addressed by reasonable accounts of inconsistency measures. We investigate the behavior of inconsistency in logic programs by revisiting existing rationality postulates for inconsistency measurement and developing novel ones taking non-monotonicity into account. Further, we develop new measures for this setting and investigate their properties.
منابع مشابه
On Equivalence and Inconsistency of Answer Set Programs with External Sources
HEX-programs extend of answer-set programs (ASP) with external sources. In previous work, notions of equivalence of ASP programs under extensions have been developed. Most well-known are strong equivalence, which is given for programs P and Q if P ∪ R and Q ∪ R have the same answer sets for arbitrary programs R, and uniform equivalence, which is given if this is guaranteed for sets R of facts. ...
متن کاملA Lower-Bound for Answer Set Solver Computation
We build upon recent work by Lierler that defines an abstract framework for describing the algorithm underlying many of the existing answer set solvers (for answer set programs, based upon the Answer Set Semantics), considering in particular SMODELS and SUP. We define a particular class of programs and prove that the computation that the abstract solver performs actually represents a lower boun...
متن کاملMarkov Logic Style Weighted Rules under the Stable Model Semantics
We introduce the language LP that extends logic programs under the stable model semantics to allow weighted rules similar to the way Markov Logic considers weighted formulas. LP is a proper extension of the stable model semantics to enable probabilistic reasoning, providing a way to handle inconsistency in answer set programming. We also show that the recently established logical relationship b...
متن کاملTowards Practical Deletion Repair of Inconsistent DL-programs
Nonmonotonic Description Logic (DL-) programs couple nonmonotonic logic programs with DL-ontologies through queries in a loose way which may lead to inconsistency, i.e., lack of an answer set. Recently defined repair answer sets remedy this but a straightforward computation method lacks practicality. We present a novel evaluation algorithm for deletion repair answer sets based on support sets, ...
متن کاملDebugging Inconsistent Answer Set Programs
In this paper we examine how we can find contradictions from Answer Set Programs (ASP). One of the most important phases of programming is debugging, finding errors that have crept in during program implementation. Current ASP systems are still mostly experimental tools and their support for debugging is limited. This paper addresses one part of ASP debugging, finding the reason why a program d...
متن کامل